A Krohn-Rhodes Theorem for categories
نویسندگان
چکیده
منابع مشابه
The Krohn-Rhodes Theorem and Local Divisors
We give a new proof of the Krohn-Rhodes theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg, avoids induction on the size of the state set, and works exclusively with monoids with the base case of the induction being that of a group.
متن کاملOn the Krohn-Rhodes Cascaded Decomposition Theorem
The Krohn-Rhodes theorem states that any deterministic automaton is a homomorphic image of a cascade of very simple automata which realize either resets or permutations. Moreover, if the automaton is counter-free, only reset automata are needed. In this paper we give a very constructive proof of a variant of this theorem due to Eilenberg.
متن کاملMerge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes
This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell's aperiodic pointlike theorem, using a new algebraic technique that we call the merge decomposition. A prototypical application of this technique decomposes a semigroup $T$ into a two-sided s...
متن کاملKrohn-Rhodes complexity pseudovarieties are not finitely based
We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most n is not finitely based for all n > 0. More specifically, for each pair of positive integers n, k, we construct a monoid of complexity n+1, all of whose k-generated submonoids have complexity at most n. Mathematics Subject Classification. 20M07.
متن کاملSecret Sharing Krohn-Rhodes: Private and Perennial Distributed Computation
In this paper we consider the problem of n agents wishing to perform a given computation on common inputs in a privacy preserving manner, in the sense that even if the entire memory contents of some of them are exposed, no information is revealed about the state of the computation, and where there is no a priori bound on the number of inputs. The problem has received ample attention recently in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1980
ISSN: 0021-8693
DOI: 10.1016/0021-8693(80)90130-1